Efficient Fixed-base exponentiation and scalar multiplication based on a multiplicative splitting exponent recoding
نویسندگان
چکیده
منابع مشابه
Exponent Recoding and Regular Exponentiation Algorithms
This paper describes methods of recoding exponents to allow for regular implementations of m-ary exponentiation algorithms. Recoding algorithms previously proposed in the literature do not lend themselves to being implemented in a regular manner, which is required if the implementation needs to resist side-channel attacks based on simple power analysis. The advantage of the algorithms proposed ...
متن کاملDouble-base scalar multiplication revisited
This paper reduces the number of field multiplications required for scalar multiplication on conservative elliptic curves. For an average 256-bit integer n, this paper’s multiply-by-n algorithm takes just 7.47M per bit on twisted Edwards curves −x + y = 1 + dxy with small d. The previous record, 7.62M per bit, was unbeaten for seven years. Unlike previous record-setting algorithms, this paper’s...
متن کاملDirect Exponent and Scalar Multiplication Classes of an MDS Matrix
Ghulam Murtaza, Nassar Ikram 1,2 National University of Sciences and Technology, Pakistan [email protected] [email protected] Abstract. An MDS matrix is an important building block adopted by different algorithms that provides diffusion and therefore, has been an area of active research. In this paper, we present an idea of direct exponent and direct square of a matrix. We prove...
متن کاملA New Left-to-Right Scalar Multiplication Algorithm Using a New Recoding Technique
Elliptic Curve Cryptosystem (ECC) is a well-known cryptosystem for securing the communications. The most important operation in ECC is scalar multiplication. The integer representation plays an important role in the performance of this operation. This paper presents and evaluates a novel recoding technique which reduces the average Hamming weight of integers. The Left-to-Right (L2R) scalar mult...
متن کاملFixed-Base Comb with Window-Non-Adjacent Form (NAF) Method for Scalar Multiplication
Elliptic curve cryptography (ECC) is one of the most promising public-key techniques in terms of short key size and various crypto protocols. For this reason, many studies on the implementation of ECC on resource-constrained devices within a practical execution time have been conducted. To this end, we must focus on scalar multiplication, which is the most expensive operation in ECC. A number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptographic Engineering
سال: 2018
ISSN: 2190-8508,2190-8516
DOI: 10.1007/s13389-018-0196-7